Population Analysis (Total Weight, CaCO3 Total Weight and Segment Numbers) of Halimedaopuntia (Linn.) Lamouroux in Tongkeina Waters, Manado
نویسندگان
چکیده
منابع مشابه
On the Total Weight of Weighted Matchings of Segment Graphs
We study the total weight of weighted matchings in segment graphs, which is related to a question concerning generalized Chebyshev polynomials introduced by Vauchassade de Chaumont and Viennot and, more recently, investigated by Kim and Zeng. We prove that weighted matchings with sufficiently large node-weight cannot have equal total weight.
متن کاملTotal weight choosability of graphs
A graph G = (V, E) is called (k, k′)-total weight choosable if the following holds: For any total list assignment L which assigns to each vertex x a set L(x) of k real numbers, and assigns to each edge e a set L(e) of k′ real numbers, there is a mapping f : V ∪ E → R such that f(y) ∈ L(y) for any y ∈ V ∪ E and for any two adjacent vertices x, x′, ∑ e∈E(x) f(e)+f(x) 6= ∑ e∈E(x′) f(e)+f(x ′). We ...
متن کاملTotal Weight Choosability of Graphs
Suppose the edges and the vertices of a simple graph G are assigned k-element lists of real weights. By choosing a representative of each list, we specify a vertex colouring, where for each vertex its colour is defined as the sum of the weights of its incident edges and the weight of the vertex itself. How long lists ensures a choice implying a proper vertex colouring for any graph? Is there an...
متن کاملTotal Weight Choosability of Trees
A total-weighting of a graph G = (V,E) is a mapping f which assigns to each element y ∈ V ∪ E a real number f(y) as the weight of y. A total-weighting f of G is proper if the colouring φf of the vertices of G defined as φf (v) = f(v) + ∑ e∋v f(e) is a proper colouring of G, i.e., φf (v) ̸= φf (u) for any edge uv. For positive integers k and k′, a graph G is called (k, k′)-total-weight-choosable ...
متن کاملTotal $k$-Rainbow domination numbers in graphs
Let $kgeq 1$ be an integer, and let $G$ be a graph. A {it$k$-rainbow dominating function} (or a {it $k$-RDF}) of $G$ is afunction $f$ from the vertex set $V(G)$ to the family of all subsetsof ${1,2,ldots ,k}$ such that for every $vin V(G)$ with$f(v)=emptyset $, the condition $bigcup_{uinN_{G}(v)}f(u)={1,2,ldots,k}$ is fulfilled, where $N_{G}(v)$ isthe open neighborhood of $v$. The {it weight} o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: JURNAL ILMIAH PLATAX
سال: 2016
ISSN: 2302-3589,2302-3589
DOI: 10.35800/jip.3.2.2015.13222